↑ Adleman, L. M. (1978). “Two theorems on random polynomial time”. Proceedings of the Nineteenth Annual IEEE Symposium on Foundations of Computing. tr. 75–83.
↑ Bennett, Charles H.; Gill, John (1981), “Relative to a Random Oracle A, P^A != NP^A != co-NP^A with Probability 1”, SIAM Journal on Computing, 10 (1): 96–113, ISSN1095-7111
↑ László Babai, Lance Fortnow, Noam Nisan, and Avi Wigderson (1993). "BPP has subexponential time simulations unless EXPTIME has publishable proofs". Computational Complexity, 3:307–318.
↑ Russell Impagliazzo and Avi Wigderson (1997). "P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma". Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 220–229. doi:10.1145/258533.258590
Valentine Kabanets (2003). "CMPT 710 – Lý thuyết độ phức tạp: Bài 16". Đại học Simon Fraser.
Christos Papadimitriou (1993). Computational Complexity (ấn bản 1). Addison Wesley. ISBN0-201-53082-1. Trang 257–259 của phần 11.3: Nguồn ngẫu nhiên. Trang 269–271 của phần 11.4: Độ phức tạp mạch.
